On Moore Tree Automata and In nite Leaf Alphabets
نویسندگان
چکیده
Innnite leaf alphabets provide a new approach to remove the connection between the sizes of the leaf alphabet and the set of states of a tree automaton. Unique minimal tree automata can be constructed for classes of tree automata; however, such a class cannot be nite.
منابع مشابه
A Domain-speciic Language for Regular Sets of Strings and Trees
We propose a new high-level programming notation, called FIDO, that we have designed to concisely express regular sets of strings or trees. In particular, it can be viewed as a domain-speciic language for the expression of nite-state automata on large alphabets (of sometimes astronomical size). FIDO is based on a combination of mathematical logic and programming language concepts. This combinat...
متن کاملA Domain - Speci c Language forRegular Sets of Strings and TreesNils
We propose a new high-level programming notation, called FIDO, that we have designed to concisely express regular sets of strings or trees. In particular, it can be viewed as a domain-speciic language for the expression of nite-state automata on large alphabets (of sometimes astronomical size). FIDO is based on a combination of mathematical logic and programming language concepts. This combinat...
متن کاملAlgorithms for Guided Tree Automata
When reading an input tree, a bottom-up tree automaton is \unaware" of where it is relative to the root. This problem is important to the eecient implementation of decision procedures for the Monadic Second-order Logic (M2L) on nite trees. In 7], it is shown how exponential state space blow-ups may occur in common situations. The analysis of the problem leads to the notion of guided tree automa...
متن کاملA Domain-Specific Language for Regular Sets of Strings and Trees
We propose a new high-level programming notation, called FIDO, that we have designed to concisely express regular sets of strings or trees. In particular, it can be viewed as a domain-speci c language for the expression of nite-state automata on large alphabets (of sometimes astronomical size). FIDO is based on a combination of mathematical logic and programming language concepts. This combinat...
متن کاملThe Regularity of Two-Way Nondeterministic Tree Automata Languages
We establish that regularly extended two-way nondeterministic tree automata with un-ranked alphabets have the same expressive power as regularly extended nondeterministic tree automata with unranked alphabets. We obtain this result by establishing regularly extended versions of a congruence on trees and of a congruence on, so called, views. Our motivation for the study of these tree models is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007